WORM colorings

WORM colorings Forbidding Cycles or Cliques

Given a coloring of the vertices, we say subgraph H is monochromatic if every vertex of H is assigned the same color, and rainbow if no pair of vertices of H are assigned the same color. Given a graph G and a forbidden graph F , we define an F -WORM coloring of G as a coloring of the vertices if G without a rainbow or monochromatic subgraph isomorphic to F . We explore such colorings especially...

Perfect $2$-colorings of the Platonic graphs

In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and  the icosahedral graph.

On the Defining Number of (2n - 2)-Vertex Colorings of Kn x Kn

How many delta-matroids are there?

J. Makowsky and B. Zilber (2004) showed that many variations of graph colorings, called CP-colorings in the sequel, give rise to graph polynomials. This is true in particular for harmonious colorings, convex colorings, mcct-colorings, and rainbow colorings, and many more. N. Linial (1986) showed that the chromatic polynomial χ(G;X) is #P-hard to evaluate for all but three values X = 0, 1, 2, wh...

Effect of Seasons and Different Substrates on Growth and Reproduction of the Compost Worm Eisenia Fetida

The experiment was carried out in a factorial arrangement with the base of randomized complete block design in three repetitions. The first factor consisted of 11 bed for eating worm and the second factor is the different seasons (spring and autumn) respectively. Traits was including number of capsules (Coconut), the number of adult worms, the number of immature worms, live worms masses (mg), m...